Finite Completeness of Categories of Petri Nets
نویسندگان
چکیده
The problem of finite completeness of categories of Petri nets is studied. Since Petri nets have finite products, the problem reduces to the issue of the existence of equalizers. We show that the categories of Petri nets with general and Winskel morphisms do not admit equalizers, and hence are not finitely complete. An important class of multiplicative Petri net morphisms is also identified. The main positive result of the paper states that reachable Petri nets and multiplicative morphisms form a finitely complete category. As an application of this result, some well-known categories turn out to be finitely complete. Since, for instance, all morphisms between reachable safe Petri nets are multiplicative it follows that the category of reachable safe Petri nets nets is finitely complete.
منابع مشابه
Mapping CRC Card into Stochastic Petri Net for Analyzing and Evaluating Quality Parameter of Security (TECHNICAL NOTE)
CRC cards are unconventional method for identifying and describing classes, behavior and its responsibilities and collaborators of class. Representation of three categories of class, responsibilities and collaborators can give proper image of scenario. These cards are effective method for analyzing scenarios. With all positive features of CRC cards, of weaknesses of these cards are failure to s...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملA rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملOn the Upward/Downward Closures of Petri Nets
We study the size and the complexity of computingfinite state automata (FSA) representing and approximatingthe downward and the upward closure of Petri net languageswith coverability as the acceptance condition. We show how toconstruct an FSA recognizing the upward closure of a Petri netlanguage in doubly-exponential time, and therefore the size is atmost doubly exponent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 43 شماره
صفحات -
تاریخ انتشار 2000